Maximal independent set - PDFSEARCH.IO - Document Search Engine

Maximal independent set
Results: 70

#	Item
21	Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011 Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:23 Analysis of algorithms Balls into bins With high probability Randomized algorithm Time complexity Chernoff bound Maximal independent set EdmondsPruhs protocol
22	eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System Thomas Locher, Stefan Schmid, Roger Wattenhofer {lochert, schmiste, wattenhofer}@tik.ee.ethz.ch Computer Engineering and Networks Laboratory (TIK), ETH Zuri Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:45 Distributed data storage Clique Chord Kademlia Distributed hash table Tapestry Adolescent cliques Content addressable network Pastry Clique percolation method Maximal independent set
23	Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen · Yvonne-Anne Pignolet · Roger Wattenhofer Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 NP-complete problems Maximal independent set Treewidth Arboricity Dominating set Planar graph Independent set Matching Graph minor Bipartite graph Line graph Planar separator theorem
24	Fast Distributed Network Decompositions and Covers Baruch Awerbuch y Bonnie Berger z David Peleg { Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:24 NP-complete problems Graph coloring Matroid theory Graph connectivity Ear decomposition Neighbourhood Degeneracy Maximal independent set Independent set Bridge Graph theory Treewidth
25	An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-06-04 05:35:50 NP-complete problems Functional analysis Vertex cover Distribution Graph coloring Dominating set Maximal independent set
26	Summarizing and Understanding Large Graphs Danai Koutra1∗ , U Kang2 , Jilles Vreeken3 and Christos Faloutsos1 1 School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA 2 Add to Reading List Source URL: eda.mmci.uni-saarland.de Language: English - Date: 2015-05-19 08:18:12 Graph theory Clique Bipartite graph Graph Degree Line graph Maximal independent set
27	Spreading Processes and Large Components in Ordered, Directed Random Graphs Paul Horn∗ Malik Magdon-Ismail Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2012-09-21 17:55:11 SL Logarithm Jnos Komls Maximal independent set
28	Improved Equilibrium Enumeration for Bimatrix Games Extended abstract June 30, 1998 Bernhard von Stengel Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2006-11-15 07:54:44 Polyhedra Game theory Computational geometry Polytopes Linear programming Vertex enumeration problem Bimatrix game Clique Independent set Polyhedron Maximal independent set Simplex
29	Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma † Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:16 Graph theory Mathematics Computational complexity theory Spanning tree NP-complete problems Dominating set Minimum spanning tree Maximal independent set Matching Travelling salesman problem Shortest path problem Tree
30	Beeping a Maximal Independent Set Yehuda Afek1 , Noga Alon1,2 , Ziv Bar-Joseph3 , Alejandro Cornejo4 , Bernhard Haeupler4 , and Fabian Kuhn5 1 3 Add to Reading List Source URL: ac.informatik.uni-freiburg.de Language: English - Date: 2012-04-03 09:53:32